Elimination of Source A and B Errors in p-Median Location Problems

A branch-and-price approach to p-median location problems

The p-median and p-center Problems on Bipartite Graphs

Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...

Location on Networks: A Survey. Part I: The p-Center and p-Median Problems

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected].. INFORMS is collaborating with JSTOR to digitize, preserve...

Quadratic Ordered Median Location Problems

The criteria used in location analysis have to be chosen according to the character of the facility. The single facility location models addressed in this paper accommodate simultaneous multiple criteria in a continuous space in the framework of ordered median problems, which generate and unify many standard location problems. We demonstrate that tools of computational geometry such as Voronoi ...

Inverse median location problems with variable coordinates

Given n + 1 points in Rd with nonnegative weights, the inverse 1-median problem with variable coordinates consists in changing the coordinates of the given points at minimum cost such that a prespecified point in Rd becomes the 1-median. The cost is proportional to the increase or decrease of the corresponding point coordinate. In case that the distances between points are measured by the recti...